Diversification-driven tabu search for unconstrained binary quadratic problems

This paper describes a Diversification-Driven Tabu Search (D²TS) algorithm for solving unconstrained binary quadratic problems. D²TS is distinguished by the introduction of a perturbation-based diversification strategy guided by long-term memory. The performance of the proposed algorithm is assessed on the largest instances from the ORLIB library (up to 2500 variables) as well as still larger instances from the literature (up to 7000 variables). The computational results show that D²TS is highly competitive in terms of both solution quality and computational efficiency relative to some of the best performing heuristics in the literature